Automatic design of decision-tree induction algorithms tailored to flexible-receptor docking data

Automatic Design of Decision-Tree Algorithms with Evolutionary Algorithms

This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms. Top-down decision-tree algorithms are of great importance, considering their ability to provide an intuitive and accurate knowledge representation for classification problems. The automatic design of these algorithms seems ...

Using Data Mining and Three Decision Tree Algorithms to Optimize the Repair and Maintenance Process

The purpose of this research is to predict the failure of devices using a data mining tool. For this purpose, at the outset, an appropriate database consists of 392 records of ongoing failures in a pharmaceutical company in 1394, in the next step, by analyzing 9 characteristics and type of failure as a database class, analyzes have been used. In this regard, three decision tree algorithms have ...

Reusable components in decision tree induction algorithms

We propose a generic decision tree framework that supports reusable components design. The proposed generic decision tree framework consists of several sub-problems which were recognized by analyzing well-known decision tree induction algorithms, namely ID3, C4.5, CART, CHAID, QUEST, GUIDE, CRUISE, and CTREE. We identified reusable components in these algorithms as well as in several of their p...

Evolutionary Algorithms in Decision Tree Induction

Flexible docking and design.

Docking and design are the major computational steps toward understanding and affecting receptor-ligand interactions. The flexibility of many ligands makes these calculations difficult and requires the development and use of special methods. The need for such tools is illustrated by two examples: the design of protease inhibitors and the analysis and design of peptide antigens binding to specif...